Online scheduling on two uniform machines to minimize the makespan
نویسندگان
چکیده
منابع مشابه
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
In this paper we deal with the problem of assigning a set of n jobs, with release dates and tails, to either one of two unrelated parallel machines and scheduling each machine so that the makespan is minimized. This problem will be denoted by R2jri; qijCmax. The model generalizes the problem on one machine 1jri; qijCmax, for which a very ecient algorithm exists. In this paper we describe a Bra...
متن کاملSimulated Annealing Algorithm to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines
This paper presents a simulated annealing algorithm to minimize makespan of single machine scheduling problem with uniform parallel machines. The single machine scheduling problem with uniform parallel machines consists of n jobs, each with single operation, which are to be scheduled on m parallel machines with different speeds. Since, this scheduling problem is a combinatorial problem; usage o...
متن کاملGA Based Heuristic to Minimize Makespan in Single Machine Scheduling Problem with Uniform Parallel Machines
This paper considers the single machine scheduling problem with uniform parallel machines in which the objective is to minimize the makespan. Four different GA based heuristics are designed by taking different combinations of crossover methods, viz. single point crossover method and two point crossover method, and job allocation methods while generating initial population, viz. equal number of ...
متن کاملA new algorithm for online uniform-machine scheduling to minimize the makespan
We consider the online scheduling problem with m − 1, m ≥ 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 ≤ s ≤ 2, to minimize the makespan. The wellknown list scheduling (LS) algorithm has a worst-case bound of 3m−1 m+1 [1]. An algorithm with a better competitive ratio was proposed in [3]. It has a worst-case bound of 2.8795 for a big m and s = 2. In...
متن کاملTwo semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.01.007